On full Souslin trees
نویسنده
چکیده
In the present note we answer a question of Kunen (15.13 in [Mi91]) showing (in 1.7) that it is consistent that there are full Souslin trees. ∗ We thank the NSF for partially supporting this research under grant #144-EF67. Publication No 624.
منابع مشابه
More on Almost Souslin Kurepa Trees
It is consistent that there exists a Souslin tree T such that after forcing with it, T becomes an almost Souslin Kurepa tree. This answers a question of Zakrzewski [6].
متن کاملHigher Souslin Trees and the Gch, Revisited
It is proved that for every uncountable cardinal λ, GCH+ (λ) entails the existence of a cf(λ)-complete λ-Souslin tree. In particular, if GCH holds and there are no א2-Souslin trees, then א2 is weakly compact in Gödel’s constructible universe, improving Gregory’s 1976 lower bound. Furthermore, it follows that if GCH holds and there are no א2 and א3 Souslin trees, then the Axiom of Determinacy ho...
متن کاملForcing with a Coherent Souslin Tree
We investigate the effect of forcing with a coherent Souslin trees on two standard set-theoretic dichotomies and several topological chain conditions.
متن کاملA microscopic approach to Souslin-tree constructions, Part I
We propose a parameterized proxy principle from which κ-Souslin trees with various additional features can be constructed, regardless of the identity of κ. We then introduce the microscopic approach, which is a simple method for deriving trees from instances of the proxy principle. As a demonstration, we give a construction of a uniformly coherent κ-Souslin tree that applies also for κ inaccess...
متن کامل2 2 Fe b 20 06 Degrees of Rigidity for Souslin Trees ∗ Gunter
We investigate various strong notions of rigidity for Souslin trees, separating them under ♦ into a hierarchy. Applying our methods to the automorphism tower problem in group theory, we show under ♦ that there is a group whose automorphism tower is highly malleable by forcing.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1999